Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures
نویسندگان
چکیده
Effectively parallelizing SAT solving is an open and important issue. The current stateof-the-art is based on parallel portfolios. This technique relies on running multiple solvers on the same instance in parallel. As soon as one instance finishes, the entire run stops. Several successful systems even use Plain Parallel Portfolio (PPP), where the individual solvers do not exchange any information. This paper contains a thorough experimental evaluation of PPP, which shows that PPP can improve wall-clock runtime. This improvement is due to the fact that memory access is still local and the memory system can hide the latency of memory access, respectively. In particular, there does not seem as much cache congestion as one might imagine. We further present some limits on the scalability of PPP and finally give one argument why PPP solvers are a good fit for todays multi-core architectures.
منابع مشابه
A parallel portfolio SAT solver with lockless physical clause sharing
Since multi–core architectures have become well–established the enquiry for parallel SAT solvers has drastically increased. Meanwhile, several successful SAT solvers have been presented that can be run in parallel mode. However, there are only a few solvers that use the shared memory architectures for physical clause sharing. In this paper we present a parallel SAT solver that allows for sharin...
متن کاملAlgorithm Configuration for Portfolio-based Parallel SAT-Solving
Since 2004, the increases in processing power enabled by Moore’s law have been primarily achieved by means of multi-core processor architectures. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for SAT, one of the most widely studied NP...
متن کاملImproving SAT Solver Efficiency Using a Multi-Core Approach
Many practical problems in multiple fields can be converted to a SAT problem, or a sequence of SAT problems, such that their solution immediately implies a solution to the original problem. Despite the enormous progress achieved over the last decade in the development of SAT solvers, there is strong demand for higher algorithm efficiency to solve harder and larger problems. The widespread avail...
متن کاملCooperation control in Parallel SAT Solving: a Multi-armed Bandit Approach
In recent years, Parallel SAT solvers have leveraged with the so called Parallel Portfolio architecture. In this setting, a collection of independent ConflictDirected Clause Learning (CDCL) algorithms compete and cooperate through Clause Sharing. However, when the number of cores increases, systematic clause sharing between CDCLs can slow down the search performance. Previous work has shown how...
متن کاملA Concurrent Portfolio Approach to SMT Solving
With the availability of multi-core processors and large-scale computing clusters, the study of parallel algorithms has been revived throughout the industry. We present a portfolio approach to deciding the satisfiability of SMT formulas, based on the recent success of related algorithms for the SAT problem. Our parallel version of Z3 outperforms the sequential solver, with speedups of well over...
متن کامل